Model Checking Population Protocols
نویسندگان
چکیده
Population protocols are a model for parameterized systems in which a set of identical, anonymous, finite-state processes interact pairwise through rendezvous synchronization. In each step, the pair of interacting processes is chosen by a random scheduler. Angluin et al. (PODC 2004) studied population protocols as a distributed computation model. They characterized the computational power in the limit (semi-linear predicates) of a subclass of protocols (the well-specified ones). However, the modeling power of protocols go beyond computation of semi-linear predicates and they can be used to study a wide range of distributed protocols, such as asynchronous leader election or consensus, stochastic evolutionary processes, or chemical reaction networks. Correspondingly, one is interested in checking specifications on these protocols that go beyond the well-specified computation of predicates. In this paper, we characterize the decidability frontier for the model checking problem for population protocols against probabilistic linear-time specifications. We show that the model checking problem is decidable for qualitative objectives, but as hard as the reachability problem for Petri nets—a well-known hard problem without known elementary algorithms. On the other hand, model checking is undecidable for quantitative properties. 1998 ACM Subject Classification D.2.4 Software/Program Verification, F.1.1 Models of Computation
منابع مشابه
A short introduction to two approaches in formal verification of security protocols: model checking and theorem proving
In this paper, we shortly review two formal approaches in verification of security protocols; model checking and theorem proving. Model checking is based on studying the behavior of protocols via generating all different behaviors of a protocol and checking whether the desired goals are satisfied in all instances or not. We investigate Scyther operational semantics as n example of this...
متن کاملModel Checking Population Protocols in PAT with Symmetry Reduction
The population protocol model has emerged as an elegant computation paradigm for describing mobile ad hoc networks, consisting of a number of mobile nodes that interact with each other to carry out a computation. The interactions of nodes are subject to a global fairness constraint, which plays a vital role in designing self-stabilizing population protocols. In this chapter, we focus on automat...
متن کاملGuidelines for Verification of Population Protocols
We address the problem of verification by modelchecking of basic population protocol (PP) model of Angluin et al. This problem has received special attention the last two years and new tools have been proposed to deal with. We show that the problem can be solved using the existing modelchecking tools, e.g., Spin and Prism. For this, we apply the counting abstraction to obtain an abstract model ...
متن کاملInvestigating Parametric Influence on Discrete Synchronisation Protocols Using Quantitative Model Checking
Synchronisation is an emergent phenomenon observable in nature. Natural synchronising systems have inspired the development of protocols for achieving coordination in a diverse range of distributed dynamic systems. Spontaneously synchronising systems can be mathematically modelled as coupled oscillators. In this paper we present a novel approach using model checking to reason about achieving sy...
متن کاملClassical Security Protocols for QKD Systems
The purpose of this report is to document the three principal classes of classic cryptographic protocols which are needed in systems for quantum key distribution. We will detail the protocols used for secretkey reconciliation by public discussion, privacy ampli cation by public discussion, and unconditionally secure authentication. We suggest the use of the model checking method for the analys...
متن کامل